Rigorous bounds for optimal dynamical decoupling
نویسندگان
چکیده
منابع مشابه
Rigorous bounds for optimal dynamical decoupling
We present rigorous performance bounds for the optimal dynamical decoupling pulse sequence protecting a quantum bit (qubit) against pure dephasing. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We show that if the total sequence time is fixed...
متن کاملRigorous performance bounds for quadratic and nested dynamical decoupling
We present rigorous performance bounds for the quadratic dynamical decoupling pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumptions of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in...
متن کاملRigorous bounds on the performance of a hybrid dynamical-decoupling quantum-computing scheme
We study dynamical decoupling in a multiqubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the computation. We derive a rigorous error bound on the trace distance or fidelity between the desired computational state and the actual time-evolved state, for a system...
متن کاملNear-optimal dynamical decoupling of a qubit.
We present a near-optimal quantum dynamical decoupling scheme that eliminates general decoherence of a qubit to order n using O(n2) pulses, an exponential decrease in pulses over all previous decoupling methods. Numerical simulations of a qubit coupled to a spin bath demonstrate the superior performance of the new pulse sequences.
متن کاملRigorous Error Bounds for the Optimal Value in Semidefinite Programming
A wide variety of problems in global optimization, combinatorial optimization as well as systems and control theory can be solved by using linear and semidefinite programming. Sometimes, due to the use of floating point arithmetic in combination with ill-conditioning and degeneracy, erroneous results may be produced. The purpose of this article is to show how rigorous error bounds for the optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2010
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.82.012301